Hypergraph Optimization Problems: Why is the Objective Function Linear?
نویسندگان
چکیده
منابع مشابه
Linear Objective Function Optimization with the Max-product Fuzzy Relation Inequality Constraints
In this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. Since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. We study this problem and capture some special characteristics of its feasible domain and optimal s...
متن کاملA random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
In this paper we propose a variant of the random coordinate descent method for solving linearly constrained convex optimization problems with composite objective functions. If the smooth part of the objective function has Lipschitz continuous gradient, then we prove that our method obtains an ε-optimal solution in O(N/ε) iterations, where N is the number of blocks. For the class of problems wit...
متن کاملOPTIMIZATION OF LINEAR OBJECTIVE FUNCTION SUBJECT TO FUZZY RELATION INEQUALITIES CONSTRAINTS WITH MAX-AVERAGE COMPOSITION
In this paper, the finitely many constraints of a fuzzy relationinequalities problem are studied and the linear objective function on the regiondefined by a fuzzy max-average operator is optimized. A new simplificationtechnique which accelerates the resolution of the problem by removing thecomponents having no effect on the solution process is given together with analgorithm and a numerical exa...
متن کاملOptimization of linear objective function subject to Fuzzy relation inequalities constraints with max-product composition
In this paper, we study the finitely many constraints of the fuzzyrelation inequality problem and optimize the linear objectivefunction on the region defined by the fuzzy max-product operator.Simplification operations have been given to accelerate theresolution of the problem by removing the components having noeffect on the solution process. Also, an algorithm and somenumerical and applied exa...
متن کاملlinear objective function optimization with the max-product fuzzy relation inequality constraints
in this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. we study this problem and capture some special characteristics of its feasible domain and optimal s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1996
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v3i50.20053